Dynamic Decremental Approximate Distance Oracles with $(1+\epsilon, 2)$ stretch
نویسندگان
چکیده
We provide a decremental approximate Distance Oracle that obtains stretch of 1 + ǫ multiplicative and 2 additive and has Ô(n) total cost (where Ô notation suppresses polylogarithmic and n √
منابع مشابه
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier
A fully dynamic approximate distance oracle is a distance reporting data structure that supports dynamic insert edge and delete edge operations. In this paper we break a longstanding barrier in the design of fully dynamic all-pairs approximate distance oracles. All previous results for this model incurred an amortized cost of at least Ω(n) per operation. We present the first construction that p...
متن کاملDistance Oracles for Sparse Graphs
Suppose you are given a large network, such as the Internet or the US road network. In many practical applications, one might be interested in querying shortest path distances between pairs of nodes of the network. However, attempting to implement a data structure that supports such operations will result either in a large query time, or large space requirement, both of which are undesirable. I...
متن کاملFaster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any pair of vertices. A lower bound, due to Thorup and Zwick, shows that a distance oracle that returns paths of worst-case stretch (2k − 1) must require space Ω(n) for graphs over n nodes. The hard cases that enforce this ...
متن کاملApproximating Approximate Distance Oracles
Given a finite metric space (V, d), an approximate distance oracle is a data structure which, when queried on two points u, v ∈ V , returns an approximation to the the actual distance between u and v which is within some bounded stretch factor of the true distance. There has been significant work on the tradeoff between the important parameters of approximate distance oracles (and in particular...
متن کاملConstant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs
We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time. The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and pre-processing time $...
متن کامل